A survey of P2P multidimensional indexing structures
نویسندگان
چکیده
Traditional databases have long since reaped the benefits of multidimensional indexes. Numerous proposals in the literature describe multidimensional index designs for P2P systems. However, none of these designs have had real world implementations. Several proposals for P2P multidimensional indexes are reviewed and analyzed. Znet and VBI-tree are the most promising from a technical standpoint. All of the proposed designs assume honest nodes and are thus open to abuse. This is a critical flaw that must be solved before any of the proposed systems can be used.
منابع مشابه
An efficient peer-to-peer indexing tree structure for multidimensional data
As one of the most important technology for implementing large-scale distributed systems, peer-to-peer (P2P) computing has attracted much attention in both research and academia communities, for its advantages such as high availability, high performance, and high flexibility to the dynamics of networks. However, multidimensional data indexing remains as a big challenge to P2P computing, because...
متن کاملA Short Survey on P2P Data Indexing
P2P data indexing has recently attracted a great many research efforts. For various proposed schemes, there are generally two taxonomies: 1) From a systematic point of view, existing schemes fall into two categories: the over-DHT indexing paradigm, which as a layered manner, indexes data in DHT key space (i.e., over DHT), and the overlay-dependent indexing paradigm, which indexes data directly ...
متن کاملOn Indexing Multidimensional Data In A P2P Context
Based on their remarkable properties (fault tolerance, scalability, decentralization), P2P systems tend to be largely accepted as a common support for deploying massively distributed data management applications. Some of the existing P2P systems are built over hybrid networks where certain peers are specialized in indexing. Others make use of DHTs as common support for data indexing. However, o...
متن کاملFlexible Information Discovery in Decentralized Distributed Systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distributed environments such as computational Grids and Peer-to-Peer (P2P) storage and retrieval systems. This paper presents a P2P information discovery system that supports flexible queries using partial keywords and wildc...
متن کاملP2P Network Trust Management Survey
Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1507.05501 شماره
صفحات -
تاریخ انتشار 2015